Imperative Process Algebra with Abstraction

This paper introduces an imperative process algebra based on ACP (Algebra of Communicating Processes). Like other algebras, this deals with processes the kind that arises from execution programs. It distinguishes itself already existing algebras among things by supporting abstraction actions are considered not to be visible. The support opens interesting application possibilities algebra. goes briefly into possibility information-flow security analysis is concerned leakage confidential data. For presented axiomatization, soundness and semi-completeness results respect a notion branching bisimulation equivalence established.